Enhanced Constraint Dependency Grammar Parsers
نویسندگان
چکیده
Constraint Dependency Grammar CDG is a constraint based grammatical formalism that has a weak generative capacity beyond context free gram mars and supports a very exible parsing algorithm for working with feature grammars however the running time of the parser is O n Hence we have investi gated how to improve the running time of the parser by applying feature constraints di erentially and by using aggregate unary constraints which can be applied in O n time Additional speedup was achieved by in tegrating the ltering algorithm more tightly with the parser and by supporting the use of a varying number of roles for word classes
منابع مشابه
BANK OF ENGLISH AND BEYOND Hand-crafted parsers for functional annotation
The 200 million word corpus of the Bank of English was annotated morphologically and syntactically using the English Constraint Grammar analyser, a rulebased shallow parser developed at the Research Unit for Computational Linguistics, University of Helsinki. We discuss the annotation system and methods used in the corpus work, as well as the theoretical assumptions of the Constraint Grammar syn...
متن کاملUSAEnhanced Constraint Dependency Grammar Parsers
Constraint Dependency Grammar (CDG) is a constraint-based grammatical formalism which has a weak generative capacity beyond context-free grammars and supports a very exible parsing algorithm for working with feature grammars; however, the running time of the parser is O(n 4). Hence, we have investigated how to improve the running time of the parser by applying feature constraints diierentially ...
متن کاملWide-Coverage Deep Statistical Parsing Using Automatic Dependency Structure Annotation
A number of researchers (Lin 1995; Carroll, Briscoe, and Sanfilippo 1998; Carroll et al. 2002; Clark and Hockenmaier 2002; King et al. 2003; Preiss 2003; Kaplan et al. 2004;Miyao and Tsujii 2004) have convincingly argued for the use of dependency (rather than CFG-tree) representations for parser evaluation. Preiss (2003) and Kaplan et al. (2004) conducted a number of experiments comparing “deep...
متن کاملA Two Stage Constraint - Based Dependency Parser for Free Word Order Languages
The paper proposes a broad coverage twostage constraint based dependency parser for free word order languages. For evaluating the parser and to ascertain its coverage we show its performance on Hindi which is a free word order language. We compare our results with that of two data-driven parsers which were trained on a subpart of a Hindi Treebank. The final results are good with a maximum attac...
متن کاملA Statistical Constraint Dependency Grammar (CDG) Parser
CDG represents a sentence’s grammatical structure as assignments of dependency relations to functional variables associated with each word in the sentence. In this paper, we describe a statistical CDG (SCDG) parser that performs parsing incrementally and evaluate it on the Wall Street Journal Penn Treebank. Using a tight integration of multiple knowledge sources, together with distance modeling...
متن کامل